Counting of a Degenerate Word in Random Sequences
نویسنده
چکیده
Overlap of words complicates the problem of word counting. The technique of the imbedded Markov chain (IMC) uses an enlarged state space to recover the Markovian property for the word counting problem. A degenerate word represents multiple non-degenerate words. An efficient way to decompose a degenerate word according to its overlapping pattern for implementing IMC is proposed.
منابع مشابه
Designing Of Degenerate Primers-Based Polymerase Chain Reaction (PCR) For Amplification Of WD40 Repeat-Containing Proteins Using Local Allignment Search Method
Degenerate primers-based polymerase chain reaction (PCR) are commonly used for isolation of unidentified gene sequences in related organisms. For designing the degenerate primers, we propose the use of local alignment search method for searching the conserved regions long enough to design an acceptable primer pair. To test this method, a WD40 repeat-containing domain protein from Beauveria bass...
متن کاملشناسایی مولکولی فسفولیپاز D به عنوان عامل مؤثر در رشد و بیماریزایی میکروارگانیسمها
Background and Objective: Secretory extracellular Phospholipases are generally involved in hydrolysis of extracellular phospholipids and thus providing nutritive source of carbon, nitrogen, and phosphate. However, intracellular phospholipases perform metabolic functions and adjust biologic activities. Synthesis of phospholipases in different pathogenic microorganisms and their mode of action in...
متن کاملIsolation of the Gene Coding for Movement Protein from Grapevine Fanleaf Virus
A pair of degenerate primers, GMPF1 and GMPR1, was designed on the basis of alignment of previously reported Grapevine fanleaf virus (GFLV) movement protein (MP) nucleotide sequences from Iran and other parts of the world. cDNA was synthesized by the use of Oligo d(T)18 from total RNA extraction from each diseased grapevine leaf sample and subjected to polymerase chain reaction (PCR) with the d...
متن کاملOn Counting Sequences and Some Research Questions
A counting sequence is a list of all binary words of the same length. Counting sequences of any fixed odd Hamming distance between successive words (codewords) are discussed. Gray codes are examples of counting sequences having a single-bit change between neighboring codewords. We describe some results on Gray codes and highlight some research questions. The spectrum of bit changes or transitio...
متن کاملUsing it Bundles in Published and Unpublished Writings
Lexical bundles are known as important elements of coherent discourse that have been the subject of much research. While the previous research has been mainly concerned with exploring variations in the use of these word sequences across different registers and disciplines, very few studies have addressed the use of some particular groups of lexical bundles within some types of academic writing....
متن کامل